Minimum Spanning Tree in Deterministic Linear Time For Graphs of High Girth
نویسندگان
چکیده
We show a simple deterministic linear time algorithm for computing the minimum spanning tree of graphs on n vertices with girth at least b(t, lg n), where t ≥ 1 is a constant and b(x, y) is a variant of the inverse of the fast-growing Ackermann function. We also prove: (i) A deterministic linear time algorithm for general graphs follows from an algorithm for graphs with girth at least g for any constant g ≥ 1; (ii) To find the minimum spanning tree of a graph G, it suffices to find the minimum spanning of any graph Ĝ obtained from G by removal of O(n/b(t, lg n)) edges for any constant t ≥ 1; (iii) Our high girth algorithm yields an alternative deterministic linear time algorithm for random graphs.
منابع مشابه
Two Linear Time Algorithms for Mst on Minor Closed Graph Classes
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in O(|V |+ |E|) time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights ...
متن کاملLecture notes for “Advanced Graph Algorithms”: Verification of Minimum Spanning Trees
We present a deterministic linear time algorithm for the Tree Path Maxima problem. As a corollary, we obtain a deterministic linear time algorithm for checking whether a given spanning tree T of a weighted graph is a minimum spanning tree.
متن کاملVerification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Koml os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge costs is a minimum spanning tree. The total computational work required by his method is much larger than linear, however. We describe a linear-time algorithm for verifying a minimum spanning tree. Our algorithm combines the result of Koml os with a preprocessing and...
متن کاملLinear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators. Disciplines Theory and Algorithms This article is available at Iowa State Univer...
متن کاملUniformly Weighted Star-Factors of Graphs
A star-factor of a graph G is a spanning subgraph of G such that each component is a star. An edge-weighting of G is a function w : E(G) −→ N, where N is the set of positive integers. Let Ω be the family of all graphs G such that every star-factor of G has the same weight under some fixed edge-weighting w. The open problem of characterizing the class Ω, posed by Hartnell and Rall, is motivated ...
متن کامل